Generalized solution techniques for preference-based constrained optimization with CP-nets
نویسندگان
چکیده
"% ! !! ! " " :( % ! ! (! ! ! ! ! ! ; %! ! ! % ( :( " ! " ! ! ! ! " ( ! " <% ! ! !% %" ! " " : ! / ! " " ! : ! " % %" ! " " : ! !%:!% ! ! = = = ; % et al. " ! ( ! > " ( ? : : ! ! ( !" ! %" ! " " : ! ? ! % ! "! : ! %! ! ! ! % (: ! ! ! !! ! %! ? : ( ! % <% ( "%
منابع مشابه
Finding the Next Solution in Constraint- and Preference-Based Knowledge Representation Formalisms
In constraint or preference reasoning, a typical task is to compute a solution, or an optimal solution. However, when one has already a solution, it may be important to produce the next solution following the given one in a linearization of the solution ordering, where more preferred solutions are ordered first. In this paper, we study the computational complexity of finding the next solution i...
متن کاملIntroducing Variable Importance Tradeoffs into CP-Nets
The ability to make decisions and to assess po tential courses of action is a comer-stone of many AI applications, and usually this requires explicit information about the decision-maker's prefer ences. In many applications, preference elic itation is a serious bottleneck. The user ei ther does not have the time, the knowledge, or the expert support required to specify complex multi-attribu...
متن کاملConstraint-Based Preferential Optimization
We first show that the optimal and undominated outcomes of an unconstrained (and possibly cyclic) CP-net are the solutions of a set of hard constraints. We then propose a new algorithm for finding the optimal outcomes of a constrained CPnet which makes use of hard constraint solving. Unlike previous algorithms, this new algorithm works even with cyclic CP-nets. In addition, the algorithm is not...
متن کاملOn Graphical Modeling of Preference and Importance
In recent years, CP-nets have emerged as a useful tool for supporting preference elicitation, reasoning, and representation. CP-nets capture and support reasoning with qualitative conditional preference statements, statements that are relatively natural for users to express. In this paper, we extend the CP-nets formalism to handle another class of very natural qualitative statements one often u...
متن کاملExtending CP-Nets with Stronger Conditional Preference Statements
A logic of conditional preferences is defined, with a language which allows the compact representation of certain kinds of conditional preference statements, a semantics and a proof theory. CP-nets can be expressed in this language, and the semantics and proof theory generalise those of CP-nets. Despite being substantially more expressive, the formalism maintains important properties of CP-nets...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010